翻訳と辞書 Words near each other ・ Vector addition system ・ Vector algebra ・ Vector algebra relations ・ Vector Analysis ・ Vector Architect ・ Vector area ・ Vector Arena ・ Vector autoregression ・ Vector boson ・ Vector bundle ・ Vector bundles on algebraic curves ・ Vector Burn ・ Vector calculus ・ Vector calculus identities ・ Vector Capital ・ Vector clock ・ Vector control ・ Vector control (motor) ・ Vector decomposition ・ Vector Direct ・ Vector directory number ・ Vector Fabrics, B.V. ・ Vector field ・ Vector Field Histogram ・ Vector field reconstruction ・ Vector fields in cylindrical and spherical coordinates ・ Vector fields on spheres ・ Vector flow ・ Vector Foiltec ・ Vector Graphic Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Vector clock ： ウィキペディア英語版 Vector clock Vector clocks is an algorithm for generating a partial ordering of events in a distributed system and detecting causality violations. Just as in Lamport timestamps, interprocess messages contain the state of the sending process's logical clock. A vector clock of a system of ''N'' processes is an array/vector of ''N'' logical clocks, one clock per process; a local "smallest possible values" copy of the global clock-array is kept in each process, with the following rules for clock updates: * Initially all clocks are zero. * Each time a process experiences an internal event, it increments its own logical clock in the vector by one. * Each time a process prepares to send a message, it sends its entire vector along with the message being sent. * Each time a process receives a message, it increments its own logical clock in the vector by one and updates each element in its vector by taking the maximum of the value in its own vector clock and the value in the vector in the received message (for every element). The vector clocks algorithm was independently developed by Colin Fidge and Friedemann Mattern in 1988. ==Partial ordering property== Vector clocks allow for the partial causal ordering of events. Defining the following: * $VC(x)$ denotes the vector clock of event $x$, and $VC(x)\_z$ denotes the component of that clock for process $z$. * * * In English: $VC(x)$ is less than $VC(y)$, if and only if $VC(x)\_z$ is less than or equal to $VC(y)\_z$ for all process indices $z$, and at least one of those relationships is strictly smaller (that is, ). * $x\; \backslash to\; y\backslash ;$ denotes that event $x$ happened before event $y$. It is defined as: if $x\; \backslash to\; y\backslash ;$, then Properties: * If , then $a\; \backslash to\; b\backslash ;$ * Antisymmetry: if , then ¬ * Transitivity: if and , then or if $a\; \backslash to\; b\backslash ;$ and $b\; \backslash to\; c\backslash ;$, then $a\; \backslash to\; c\backslash ;$ Relation with other orders: * Let $RT(x)$ be the real time when event $x$ occurs. If , then * Let $C(x)$ be the Lamport timestamp of event $x$. If , then 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Vector clock」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.